改进遗传算法求解电力网攻击无人机分队任务分配

遗传算法因其出色的寻优能力,自提出后就被广泛用于工程技术上的最优化问题求解。根据电力网攻击无人机分队任务分配的实际需要,提出基于遗传算法思想的解决方案,并在原算法基础上,采用种群分组进化的策略进行改进。详细介绍算法的基本原理和仿真步骤,再举出实际算例进行仿真,实验结果证明算法的改进取得了良好效果。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

基于遗传神经网络算法后勤指挥决策能力预测

分析了后勤指挥的主要影响因素,运用信息论中的信息压缩原理,建立和优化了后勤机关指挥决策能力预测指标体系。建立了遗传算法优化的BP神经网络后勤机关指挥能力预测模型,消除了BP神经网络存在的初始权值和阈值难以确定的局限性。给出了预测实例,证明了该算法的合理性和有效性。     

基于遗传算法的反导拦截弹助推段自动驾驶仪的设计

针对反导拦截弹助推段一般不进行大机动飞行、弹道相对平直的特点,基于小扰动线性化方程,设计了由阻尼回路、攻角回路和过载回路组成的三回路自动驾驶仪。在理想弹道计算的基础上选取特征点,在每个特征点处将弹体简化为二阶环节来近似。针对待优化参数多、且处于不同控制回路的特点,采用遗传算法对控制器参数进行优化。仿真结果证明所设计的控制器能够很好地跟踪指令信号。     

神经规则与案例融合的专家系统知识表示和推理

为了对专家系统中的知识进行表示,并使得推理变得更加准确高效,介绍了一种结合符号规则、神经网络和案例的方法。该方法是把一种混合规则,即神经规则和案例结合在一起。它与传统的基于符号规则推理不同的是,即使有一些未知的输入,也可以执行基于神经规则的推理。实验证明,与传统的专家系统比较,混合推理可以提高故障诊断的效率和精确度。     

中段智能机动突防后的虚拟目标修正研究

为实现弹头中段机动后的显式制导,进行了虚拟目标修正研究。通过在建立最大弹道包络面的基础上,提出基于穿越弹道横截面的虚拟目标修正方法,基于弹道包络横截面的大机动弹道虚拟目标计算方法,建立虚拟目标计算模型。通过仿真获得了大机动弹道对应的虚拟目标,通过显式制导方法验证了其具有较好的制导精度,此方法为工程应用和理论研究提供了重要的理论参考。     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

用非概率理论分析混合不确定性结构的可靠性

针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑到可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证了所建模型的合理性和所提方法的高效性和准确性。     

Exact likelihood inference for the exponential distribution under generalized Type‐I and Type‐II hybrid censoring

Chen and Bhattacharyya [Exact confidence bounds for an exponential parameter under hybrid censoring, Commun Statist Theory Methods 17 (1988), 1857–1870] considered a hybrid censoring scheme and obtained the exact distribution of the maximum likelihood estimator of the mean of an exponential distribution along with an exact lower confidence bound. Childs et al. [Exact likelihood inference based on Type‐I and Type‐II hybrid censored samples from the exponential distribution, Ann Inst Statist Math 55 (2003), 319–330] recently derived an alternative simpler expression for the distribution of the MLE. These authors also proposed a new hybrid censoring scheme and derived similar results for the exponential model. In this paper, we propose two generalized hybrid censoring schemes which have some advantages over the hybrid censoring schemes already discussed in the literature. We then derive the exact distribution of the maximum likelihood estimator as well as exact confidence intervals for the mean of the exponential distribution under these generalized hybrid censoring schemes. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于进化搜索策略的并行子空间设计算法

并行子空间设计是一种有效的多学科设计优化算法,但其搜索策略存在两点不足:一是寻找全局最优解能力有限,二是计算复杂。为弥补上述不足,将遗传算法应用到CSD算法中,提出了一种基于进化搜索策略的CSD算法。介绍了该算法的设计流程,应用该算法对一测试问题进行了优化,取得了满意结果。